منابع مشابه
Approximation Algorithms for Certain Network Improvement Problems
We study budget constrained network upgrading problems Such problems aim at nding optimal strategies for improving a network under some cost measure subject to certain budget constraints Given an edge weighted graph G V E in the edge based upgrading model it is assumed that each edge e of the given network also has an associated function ce t that speci es the cost of upgrading the edge by an a...
متن کاملComplexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with a polynomial time approximation scheme [6]. In this paper, both this problem and its maximization complement, where instead the number of matches is maximized, are examined and bounds on their hardness of approximatio...
متن کاملApproximation of certain multivariate integrals
A Taylor series approximation to multivariate integrals taken with respect to a multivariate probability distribution is proposed and applied to the computation of multivariate normal probabilities and conditional expectations. The approximation does not require that the multivariate distribution have a structured covariance matrix and, in its simplest form, can be written as the product of uni...
متن کاملClosest assignment constraints in discrete location problems
The objective of this paper is to identify the most promising sets of closest assignment constraints in the literature of Discrete Location Theory, helping the authors in the field to model their problems when clients must be assigned to the closest plant inside an Integer Programming formulation. In particular, constraints leading to weak Linear Programming relaxations should be avoided if no ...
متن کاملClosest-Point Problems in Computational Geometry
Michiel Smid Fakult at f ur Informatik Otto-von-Guericke-Universitat Magdeburg Universitatsplatz 2 D-39106 Magdeburg, Germany E-mail: [email protected] September 1, 1997 Abstract This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1933
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1933-05759-2